Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees
نویسندگان
چکیده
Given a finite setX, a collection T of rooted phylogenetic trees onX and an integer k, the Hybridization Number problem asks if there exists a phylogenetic network on X that displays all trees from T and has reticulation number at most k. We show two kernelization algorithms for Hybridization Number, with kernel sizes 4k(5k) and 20k(∆ − 1) respectively, with t the number of input trees and ∆ their maximum outdegree. In addition, we present an O(n) time algorithm, with n = |X| and f some computable function of k.
منابع مشابه
Computing a Relevant Set of Nonbinary Maximum Acyclic Agreement Forests
There exist several methods dealing with the reconstruction of rooted phylogenetic networks explaining different evolutionary histories given by rooted binary phylogenetic trees. In practice, however, due to insufficient information of the underlying data, phylogenetic trees are in general not completely resolved and, thus, those methods can often not be applied to biological data. In this work...
متن کاملApproximation Algorithms for Nonbinary Agreement Forests
Given two rooted phylogenetic trees on the same set of taxa X, the Maximum Agreement Forest problem (MAF) asks to find a forest that is, in a certain sense, common to both trees and has a minimum number of components. The Maximum Acyclic Agreement Forest problem (MAAF) has the additional restriction that the components of the forest cannot have conflicting ancestral relations in the input trees...
متن کاملTowards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees
It has remained an open question for some time whether, given a set of not necessarily binary (i.e. “nonbinary”) trees T on a set of taxa X , it is possible to determine in time f(r)·poly(m) whether there exists a phylogenetic network that displays all the trees in T , where r refers to the reticulation number of the network and m = |X |+ |T |. Here we show that this holds if one or both of the...
متن کاملConstructing Parsimonious Hybridization Networks from Multiple Phylogenetic Trees Using a SAT-Solver
We present an exact algorithm for constructing minimal hybridization networks from multiple trees which is based on reducing the problem to the Boolean satisfiability problem. The main idea of our algorithm is to iterate over possible hybridization numbers and to construct a Boolean formula for each of them that is satisfiable iff there exists a network with such hybridization number. The propo...
متن کاملA quadratic kernel for computing the hybridization number of multiple trees
It has recently been shown that the NP-hard problem of calculating the minimum number of hybridization events that is needed to explain a set of rooted binary phylogenetic trees by means of a hybridization network is fixed-parameter tractable if an instance of the problem consists of precisely two such trees. In this paper, we show that this problem remains fixed-parameter tractable for an arbi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 82 شماره
صفحات -
تاریخ انتشار 2014